PSK Method for Solving Intuitionistic Fuzzy Solid Transportation Problems
نویسندگان
چکیده
منابع مشابه
PSK Method for Solving Type-1 and Type-3 Fuzzy Transportation Problems
In conventional transportation problem (TP), supplies, demands and costs are always certain. In this paper, the author tried to categories the TP under the mixture of certain and uncertain environment and formulates the problem and utilizes the crisp numbers, triangular fuzzy numbers (TFNs) and trapezoidal fuzzy numbers (TrFNs) to solve the TP. The existing ranking procedure of Liou and Wang is...
متن کاملMODIFIED K-STEP METHOD FOR SOLVING FUZZY INITIAL VALUE PROBLEMS
We are concerned with the development of a K−step method for the numerical solution of fuzzy initial value problems. Convergence and stability of the method are also proved in detail. Moreover, a specific method of order 4 is found. The numerical results show that the proposed fourth order method is efficient for solving fuzzy differential equations.
متن کاملDefuzzification Method for Solving Fuzzy Linear Programming Problems
Several authors have proposed different methods to find the solution of fully fuzzy linear programming (FFLP) problems. But all the existing methods are based on the assumption that all the fuzzy coefficients and the fuzzy variables are non-negative fuzzy numbers. in this paper a new method is proposed to solve an FFLP problems with arbitrary fuzzy coefficients and arbitrary fuzzy variables, th...
متن کاملA Modified Approach for Solving Intuitionistic Fuzzy Assignment Problems
The Assignment Problem is one of the most studied, well known and important problem in mathematics and is used very often in solving problems of engineering and management sciences. In this problem denotes the cost for assigning the job to the person. This cost is usually deterministic in nature. In this paper has been considered to be generalized trapezoidal intuitionistic fuzzy numbers denote...
متن کاملAn Algorithm for Solving Intuitionistic Fuzzy Linear Bottleneck Assignment Problems
The linear bottleneck assignment problem (LBAP), which is a variation of the classical assignment problem, seeks to minimize the longest completion time rather than the sum of the completion times when a number of jobs are to be assigned to the same number of workers. If the completion times are not certain, then it is said to be a fuzzy LBAP. Here we propose a new algorithm to solve fuzzy LBAP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Fuzzy System Applications
سال: 2018
ISSN: 2156-177X,2156-1761
DOI: 10.4018/ijfsa.2018100104